New Solutions to the Firing Squad Synchronization Problems for Neural and Hyperdag P Systems

نویسندگان

  • Michael J. Dinneen
  • Yun-Bum Kim
  • Radu Nicolescu
چکیده

We propose two uniform solutions to an open question: the Firing Squad Synchronization Problem (FSSP), for hyperdag and symmetric neural P systems, with anonymous cells. Our solutions take ec +5 and 6ec +7 steps, respectively, where ec is the eccentricity of the commander cell of the dag or digraph underlying these P systems. The first and fast solution is based on a novel proposal, which dynamically extends P systems with mobile channels. The second solution is substantially longer, but is solely based on classical rules and static channels. In contrast to the previous solutions, which work for tree-based P systems, our solutions synchronize to any subset of the underlying digraph; and do not require membrane polarizations or conditional rules, but require states, as typically used in hyperdag and neural P systems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Structured Modelling with Hyperdag P Systems: Part B

In an earlier paper, we presented an extension to the families of P systems, called hyperdag P systems (hP systems), by proposing a new underlying topological structure based on the hierarchical dag structure (instead of trees or digraphs). In this paper, we develop building-block membrane algorithms for discovery of the global topological structure from the local cell point of view. In doing s...

متن کامل

On Formulations of Firing Squad Synchronization Problems

We propose a novel formulation of the firing squad synchronization problem. In this formulation we may use more than one general state and the general state to be used is determined by the boundary condition of the general. We show that the usual formulation and the new formulation yield different minimum firing times for some variations of the problem. Our results suggest that the new formulat...

متن کامل

About 4-States Solutions to the Firing Squad Synchronization Problem

We present some elements of a new family of time-optimal solutions to a less restrictive firing squad synchronization problem. These solutions are all built on top of some elementary algebraic cellular automata. Thus, this gives a very new insight on the problem and a more general way of computing on cellular automata.

متن کامل

Synchronization of P Systems with Simplex Channels

We solve the Firing Squad Synchronization Problem (FSSP), for P systems based on digraphs with simplex channels, where communication is restricted by the direction of structural arcs. Previous work on FSSP for P systems focused exclusively on P systems with duplex channels, where communication between parents and children is bidirectional. Our P solution, the first for simplex channels, require...

متن کامل

Bandwidth of Firing Squad Algorithms

The Firing Squad Synchronization Problem (FSSP) is one of the best-studied problems for Cellular Automata (CA) and is part of many more sophisticated algorithms. Solutions for it such as the one from Mazoyer or Gerken use travelling signals, a basic technique of CA algorithms. Hence in addition to their importance, they represent typical CA algorithms. Beside the interest in their bandwidth fol...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009